Matrix multiplication algorithm

Results: 82



#Item
51Avoiding Communication in Dense Linear Algebra  Grey Ballard Electrical Engineering and Computer Sciences University of California at Berkeley

Avoiding Communication in Dense Linear Algebra Grey Ballard Electrical Engineering and Computer Sciences University of California at Berkeley

Add to Reading List

Source URL: www.sandia.gov

Language: English - Date: 2013-10-08 19:17:49
52SR A Language for Parallel and Distributed Programming Ronald A. Olsson Gregory R. Andrews Michael H. Coffin

SR A Language for Parallel and Distributed Programming Ronald A. Olsson Gregory R. Andrews Michael H. Coffin

Add to Reading List

Source URL: www.cs.arizona.edu

Language: English - Date: 1999-08-13 20:39:11
53A Fast Jump Ahead Algorithm for Linear Recurrences in a Polynomial Space ? Hiroshi Haramoto1 , Makoto Matsumoto1 , and Pierre L’Ecuyer2 1  Dept. of Math., Hiroshima University, Hiroshima[removed]JAPAN,

A Fast Jump Ahead Algorithm for Linear Recurrences in a Polynomial Space ? Hiroshi Haramoto1 , Makoto Matsumoto1 , and Pierre L’Ecuyer2 1 Dept. of Math., Hiroshima University, Hiroshima[removed]JAPAN,

Add to Reading List

Source URL: www.math.sci.hiroshima-u.ac.jp

Language: English - Date: 2010-03-31 02:27:40
54JMLR: Workshop and Conference Proceedings vol:1–36, 2012  25th Annual Conference on Learning Theory A Method of Moments for Mixture Models and Hidden Markov Models

JMLR: Workshop and Conference Proceedings vol:1–36, 2012 25th Annual Conference on Learning Theory A Method of Moments for Mixture Models and Hidden Markov Models

Add to Reading List

Source URL: newport.eecs.uci.edu

Language: English - Date: 2012-05-22 10:47:20
55Journal of the ACM 49(1), pp[removed], 2002  Fast Context-Free Grammar Parsing Requires Fast Boolean Matrix Multiplication Lillian Lee Department of Computer Science, Cornell University

Journal of the ACM 49(1), pp[removed], 2002 Fast Context-Free Grammar Parsing Requires Fast Boolean Matrix Multiplication Lillian Lee Department of Computer Science, Cornell University

Add to Reading List

Source URL: www.cs.cornell.edu

Language: English - Date: 2002-04-18 09:29:25
56Quick evaluation of polynomials via Strassen’s Algorithm September 14, 2009 1

Quick evaluation of polynomials via Strassen’s Algorithm September 14, 2009 1

Add to Reading List

Source URL: people.math.gatech.edu

Language: English - Date: 2009-09-14 09:31:48
57Provably Efficient Algorithms for Numerical Tensor Algebra Edgar Solomonik  Electrical Engineering and Computer Sciences

Provably Efficient Algorithms for Numerical Tensor Algebra Edgar Solomonik Electrical Engineering and Computer Sciences

Add to Reading List

Source URL: www.eecs.berkeley.edu

Language: English - Date: 2014-09-30 16:52:17
58Contention Bounds for Combinations of Computation Graphs and Network Topologies Grey Ballard James Demmel Andrew Gearhart

Contention Bounds for Combinations of Computation Graphs and Network Topologies Grey Ballard James Demmel Andrew Gearhart

Add to Reading List

Source URL: www.eecs.berkeley.edu

Language: English - Date: 2014-08-08 18:42:18
59Michigan Focal Points  Core and Extended Designations MATHEMATICS

Michigan Focal Points Core and Extended Designations MATHEMATICS

Add to Reading List

Source URL: www.michigan.gov

Language: English - Date: 2012-12-07 20:07:35
60Michigan Focal Points  Core and Extended Designations MATHEMATICS

Michigan Focal Points Core and Extended Designations MATHEMATICS

Add to Reading List

Source URL: www.ncresa.org

Language: English - Date: 2009-09-08 12:08:33